#include<stdio.h>
#define N 200000000
char prime[N+1];
void fill(){
    int i,j;
    for(i=0;i<=N;i++)prime[i]=1;
    prime[0]=prime[1]=0;
    for(i=2;i*i<=N;i++)
        if(prime[i])
            for(j=i*i;j<=N;j+=i)
                prime[j]=0;
}

int main(){
    fill();
    int n,p,find;
    for(n=6;n<=N;n+=2){
        find=0;
        for(p=3;p<=n/2;p+=2)
            if(prime[p]&&prime[n-p])
            {
              // printf("%d=%d+%d\n",n,p,n-p);
               find=1;
               break;
            }

        if(find==0)
            puts("Congratulations! ");

    }
    return 0;
}
